On the dominant of the s-t-cut polytope
نویسندگان
چکیده
The natural linear programming formulation of the maximum s-t-flow problem in path variables has a dual linear program whose underlying polyhedron is the dominant P↑ s-t-cut of the s-t-cut polytope. We present a complete characterization of P↑ s-t-cut with respect to vertices, facets, and adjacency.
منابع مشابه
On the dominant of the s-t-cut polytope: Vertices, facets, and adjacency
The natural linear programming formulation of the maximum s-t-flow problem in path variables has a dual linear program whose underlying polyhedron is the dominant P↑ s-t-cut of the s-t-cut polytope. We present a complete characterization of P↑ s-t-cut with respect to vertices, facets, and adjacency.
متن کاملEffect of IL-2 co-expressed or co-inoculated with immuno-dominant epitopes from VP1 protein of FMD virus on immune responses in BALB/c mice
Objective(s): The results of studies on vaccine development for foot-and-mouth disease (FMD) virus show that the use of inactivated vaccines for FMD virus is not completely effective. Novel vaccinations based on immuno-dominant epitopes have been shown to induce immune responses. Furthermore, for safety of immunization, access to efficient adjuvants against FMD virus seems to be critical.Materi...
متن کاملA remark on asymptotic enumeration of highest weights in tensor powers of a representation
We consider the semigroup $S$ of highest weights appearing in tensor powers $V^{otimes k}$ of a finite dimensional representation $V$ of a connected reductive group. We describe the cone generated by $S$ as the cone over the weight polytope of $V$ intersected with the positive Weyl chamber. From this we get a description for the asymptotic of the number of highest weights appearing in $V^{otime...
متن کاملLogical s-t Min-Cut Problem: An Extension to the Classic s-t Min-Cut Problem
Let $G$ be a weighted digraph, $s$ and $t$ be two vertices of $G$, and $t$ is reachable from $s$. The logical $s$-$t$ min-cut (LSTMC) problem states how $t$ can be made unreachable from $s$ by removal of some edges of $G$ where (a) the sum of weights of the removed edges is minimum and (b) all outgoing edges of any vertex of $G$ cannot be removed together. If we ignore the second constraint, ca...
متن کاملLifting and separation procedures for the cut polytope
The max-cut problem and the associated cut polytope on complete graphs have been extensively studied over the last 25 years. However, little research has been conducted for the cut polytope on arbitrary graphs. In this study we describe new separation and lifting procedures for the cut polytope on such graphs. These procedures exploit algorithmic and structural results known for the cut polytop...
متن کامل